Representation Results for Default Logics
نویسنده
چکیده
Normal forms play an important role in computer science, for example in the areas of logic and databases. This paper provides a study of normal forms for some prominent logics for default reasoning. In particular we show that in Constrained and in Justiied Default Logic, semi{normal default theories can represent arbitrary default theories. The main result for Justiied Default Logic requires the signature (logical language) to be enhanced in order to obtain the desired outcome.
منابع مشابه
A Terminological Default Logic
Terminological Logics are knowledge representation formalisms of considerable applicative interest, as they are speci cally oriented to the vast class of application domains that are describable by means of taxonomic organizations of complex objects. Although the eld of terminological logics has lately been an active area of investigation, few researchers (if any) have addressed the problem of ...
متن کاملDefault geasoning, Nonmonotonic Logics, and the Frame Problem
Nonmonotonic formal systems have been proposed as an extension to classical first-order logic that will capture the process of human “default reasoning” or “plausible inference” through their inference mechanisms just as modus ponena provides a model for deductive reasoning. But although the technical properties of these logics have been studied in detail and many examples of human default reas...
متن کاملDefault Reasoning, Nonmonotonic Logics, and the Frame Problem
Nonmonotonic formal systems have been proposed as an extension to classical first-order logic that will capture the process of human “default reasoning” or “plausible inference” through their inference mechanisms just as modus ponena provides a model for deductive reasoning. But although the technical properties of these logics have been studied in detail and many examples of human default reas...
متن کاملDefault Inheritance Reasoning in Hybrid KL-ONE-Style Logics
Hybrid KL-ONE-style logics are knowledge representation formalisms of considerable applicative interest, as they are specifically oriented to the vast class of application domains that are describable by means of taxonomic organizations of complex objects. In this paper we consider the problem of endowing such logics with capabilities for default inheritance reasoning, a kind of default reasoni...
متن کاملQuerying Disjunctive Database Through Nonmonotonic Logics
Query languages for retrieving information from disjunctive databases are an interesting open area of research. In this paper we study the expressive power of major non-monotonic formalisms { such as circumscription, default logic, autoepis-temic logic and some logic programming languages { used as query languages over disjunctive databases. For this aim, we deene the semantics of query express...
متن کامل